Cache-Aided General Linear Function Retrieval
نویسندگان
چکیده
منابع مشابه
Cache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the user privately...
متن کاملFundamental Limits of Cache-Aided Private Information Retrieval with Unknown and Uncoded Prefetching
We consider the problem of private information retrieval (PIR) fromN non-colluding and replicated databases when the user is equipped with a cache that holds an uncoded fraction r from each of the K stored messages in the databases. We assume that the databases are unaware of the cache content. We investigate D∗(r) the optimal download cost normalized with the message size as a function of K, N...
متن کاملCache-Aided Private Information Retrieval with Partially Known Uncoded Prefetching: Fundamental Limits
We consider the problem of private information retrieval (PIR) from N non-colluding and replicated databases, when the user is equipped with a cache that holds an uncoded fraction r of the symbols from each of the K stored messages in the databases. This model operates in a two-phase scheme, namely, the prefetching phase where the user acquires side information and the retrieval phase where the...
متن کاملCache-Aided Non-Orthogonal Multiple Access
In this paper, we propose a novel joint caching and non-orthogonal multiple access (NOMA) scheme to facilitate advanced downlink transmission for next generation cellular networks. In addition to reaping the conventional advantages of caching and NOMA transmission, the proposed cache-aided NOMA scheme also exploits cached data for interference cancellation which is not possible with separate ca...
متن کاملCache-Aided Combination Networks with Secrecy Guarantees
In this paper, we study a cache-aided combination network, where a layer of relay nodes connects a server to a set of end users, under three different secrecy requirements. Both the relays and the end users are equipped with caches. First, we consider secure delivery where we require that an external entity must not gain any information about the database files by observing the transmitted sign...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2020
ISSN: 1099-4300
DOI: 10.3390/e23010025